Worst-case comparison of valid inequalities for the TSP
نویسنده
چکیده
We consider most of the known classes of valid inequalities for the graphical travelling salesman polyhedron and compute the worst-case improvement resulting from their addition to the subtour polyhedron. For example, we show that the comb inequalities cannot improve the subtour bound by a factor greater than ~. The corresponding factor for the class of clique tree inequalities is 8, while it is 4 for the path configuration inequalities.
منابع مشابه
Seedlings in the Theory of Shortest Paths
This article explores three developments that arise from the fundamental theorem of Beardwood, Halton, and Hammersley on the asymptotic behavior of the shortest path through n random points. The first development concerns the role of martingales in the theory of shortest paths, especially their role in large deviation inequalities. The second development concerns the use of Lipschitz spacefilli...
متن کاملA polyhedral study of the Multi-Depot Multiple TSP
We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NPhard problem because it includes the TSP as a particular case when there is only one dep...
متن کاملClutter nonidealness
Several key results for set packing problems do not seem to be easily or even possibly transferable to set covering problems, although the symmetry between them. The goal of this paper is to introduce a nonidealness index by transferring the ideas used for the imperfection index defined by Gerke and McDiarmid [Graph imperfection, J. Combin. Theory Ser. B 83 (2001) 58–78]. We found a relationshi...
متن کاملFrom valid inequalities to heuristics : a unified view of primal - dual approximation algortithms in covering problems
We propose a primal dual approach to design approximation algorithms from stronger integer programming formulations of the covering type. We also quantify the notion of strength of different valid inequalities for discrete optimization problems of the covering type and show that the proposed primal dual algorithm has worst case performance bounded by the strength of the valid inequalities used ...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 69 شماره
صفحات -
تاریخ انتشار 1995